Using Multi-Thread Technology Realize Most Short-Path Parallel Algorithm
نویسندگان
چکیده
The shortest path question is in a graph theory model question, and it is applied in many fields. The most short-path question may divide into two kinds: Single sources most short-path, all apexes to most short-path. This article mainly introduces the problem of all apexes to most short-path, and gives a new parallel algorithm of all apexes to most short-path according to the Dijkstra algorithm. At last this paper realizes the parallel algorithms in the technology of C # multithreading. Keywords—Dijkstra algorithm, parallel algorithms, multi-thread technology, most short-path, ratio.
منابع مشابه
Near-Minimum-Time Motion Planning of Manipulators along Specified Path
The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...
متن کاملPerformance Analysis of Single Source Shortest Path Algorithm over Multiple GPUs in a Network of Workstations using OpenCL and MPI
Graphics Processing Units (GPUs) are being heavily used in various graphics and non-graphics applications. Many practical problems in computing can be represented as graphs to arrive at a particular solution. These graphs contains very large number, up to millions pairs of vertices and edges. In this paper, we present performance analysis of Dijkstra’s single source shortest path algorithm over...
متن کاملEfficient Parallel Implementation of Single Source Shortest Path Algorithm on GPU Using CUDA
In today‟s world there are number of applications like routing in telephone networks, traveller information system, robotic path selection etc., where data can be represented as a graph and different graph algorithms are executed on it to fulfil the requirements of the application. Data related to these applications are growing every day, but we still need quick and real time responses from the...
متن کاملAn Integration Approach for XML Query Parallelization on Multi-thread Systems
The key function parts of an XML query system include XML parsing, XPath and XQuery evaluation. Each part has its specific parallel opportunity and approach. And the efficiency of each part directly affects the overall effect of XML query parallelization. Therefore it is necessary to coordinate each part in a real query application to achieve the best overall parallel performance. In this paper...
متن کاملPareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times
This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...
متن کامل